5,718 research outputs found
Simultaneous Localization and Recognition of Dynamic Hand Gestures
A framework for the simultaneous localization and recognition of dynamic hand gestures is proposed. At the core of this framework is a dynamic space-time warping (DSTW) algorithm, that aligns a pair of query and model gestures in both space and time. For every frame of the query sequence, feature detectors generate multiple hand region candidates. Dynamic programming is then used to compute both a global matching cost, which is used to recognize the query gesture, and a warping path, which aligns the query and model sequences in time, and also finds the best hand candidate region in every query frame. The proposed framework includes translation invariant recognition of gestures, a desirable property for many HCI systems. The performance of the approach is evaluated on a dataset of hand signed digits gestured by people wearing short sleeve shirts, in front of a background containing other non-hand skin-colored objects. The algorithm simultaneously localizes the gesturing hand and recognizes the hand-signed digit. Although DSTW is illustrated in a gesture recognition setting, the proposed algorithm is a general method for matching time series, that allows for multiple candidate feature vectors to be extracted at each time step.National Science Foundation (CNS-0202067, IIS-0308213, IIS-0329009); Office of Naval Research (N00014-03-1-0108
Bounds for graph regularity and removal lemmas
We show, for any positive integer k, that there exists a graph in which any
equitable partition of its vertices into k parts has at least ck^2/\log^* k
pairs of parts which are not \epsilon-regular, where c,\epsilon>0 are absolute
constants. This bound is tight up to the constant c and addresses a question of
Gowers on the number of irregular pairs in Szemer\'edi's regularity lemma.
In order to gain some control over irregular pairs, another regularity lemma,
known as the strong regularity lemma, was developed by Alon, Fischer,
Krivelevich, and Szegedy. For this lemma, we prove a lower bound of
wowzer-type, which is one level higher in the Ackermann hierarchy than the
tower function, on the number of parts in the strong regularity lemma,
essentially matching the upper bound. On the other hand, for the induced graph
removal lemma, the standard application of the strong regularity lemma, we find
a different proof which yields a tower-type bound.
We also discuss bounds on several related regularity lemmas, including the
weak regularity lemma of Frieze and Kannan and the recently established regular
approximation theorem. In particular, we show that a weak partition with
approximation parameter \epsilon may require as many as
2^{\Omega(\epsilon^{-2})} parts. This is tight up to the implied constant and
solves a problem studied by Lov\'asz and Szegedy.Comment: 62 page
- …